//
// Created by 下次一定 on 2021/9/4.
//矩阵差分
//

#include <iostream>

using namespace std;

int n;
const int N = 10010;

int a[N][N], b[N][N];

void insert(int x1, int y1, int x2, int y2, int c) {
    b[x1][y1] += c;
    b[x2 + 1][y1] -= c;
    b[x1][y2 + 2] -= c;
    b[x2 + 1][y2 + 1] += c;
}


int main() {
    scanf("%d", &n);

    int count = 0;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) {
            a[i][j] = count++;
            insert(i, j, i, j, a[i][j]);
        }
    int x1, x2, y1, y2, c;
    cin >> x1 >> x2 >> y1 >> y2 >> c;
    insert(x1, y1, x2, y2, c);

    for(int i = 1 ; i <= n ; i++){
        for(int j = 1 ; j <= n; j++){
            b[i][j] +=b[i-1][j] +b[i][j-1]-b[i-1][j-1];
        }
    }

}